A T-time Petri net extension for real-time task scheduling modeling
نویسندگان
چکیده
In order to analyze whether timing requirements of a real-time application are met, we propose an extension of the T-time Petri net model which takes into account the scheduling of the software tasks distributed over a multi-processor hardware architecture. The paper is concerned with static priority pre-emptive based scheduling. This extension consists in mapping into the Petri net model the way the different schedulers of the system activate or suspend the tasks. This relies on the introduction of two new attributes for the places (allocation and priority). First we give the formal semantics of this extended model as a timed transition system (TTS). Then we propose a method for its analysis consisting in the computation of the state class graph. Thus the verification of timing properties can be conducted (possibly together with an observator) and comes to analyze the such obtained state class graph. RÉSUMÉ. Dans un objectif de vérification du respect des contraintes temporelles d’exécution d’une application temps réel, nous proposons une extension des réseaux de Petri T-temporels permettant de prendre en compte l’ordonnancement des différentes entités logicielles de l’application réparties sur une architecture matérielle multi-processeurs. La politique d’ordonnancement considérée est préemptive et à priorités fixes. Cette extension consiste à projeter sur le modèle l’activation ou le blocage (par les différents ordonnanceurs du système) des entités logicielles que modélisent les places du réseau et ce, à partir de deux nouveaux paramètres (placement et priorité) associés aux places. Nous donnons dans un premier temps la sémantique formelle de ce modèle sous la forme d’un système de transitions temporisé (TTS) puis nous proposons une méthode d’analyse de ce modèle par le calcul du graphe des classes d’état. La vérification de propriétés temporelles peut alors être effectuée (avec ou non l’adjonction d’un observateur) par un examen du graphe des classes d’état ainsi obtenu.
منابع مشابه
Petri Net Modeling for Parallel Bank ATM Systems
In this paper the real time operation of an automatic teller machine (ATM) is analyzed using aTimed Petri Net (TPN) model. In the modeling, the probability of arrivals, the speed andattentiveness of customers (clients) are taken to account. Different parameters are based onthe statistical data. The model is simulated for 24 hours. The diagrams of number ofsucceeded customers, failed references ...
متن کاملModeling Concurrent, Sequential, Storage, Retrieval, and Scheduling Activities of Multimedia Systems
As real-time systems continue to grow, performance evaluation plays a critical role in the design of these systems since the computation time, the service time, and the responsive actions must satisfy the time constraints. One of these systems is the real-time distributed multimedia-on-demand (MOD) service system. The MOD system usually fails when it misses a task deadline. The main units of th...
متن کاملSoccer Goalkeeper Task Modeling and Analysis by Petri Nets
In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...
متن کاملA Petri-net based modeling tool, for analysis and evaluation of computer systems
Petri net is one of the most popular methods in modeling and evaluation of concurrent and event-based systems. Different tools have been created to support modeling and simulation of different extensions of Petri net in different applications. Each tool supports some extensions and some features. In this work a Petri net based modeling and evaluation tool is presented that not only supports dif...
متن کاملPerformance evaluation of threshold-based ATM cell scheduling policies under Markov modulated Poisson traffic using stochastic Petri nets
This paper addresses the modelling and evaluation of cell scheduling policies in ATM multiplexers using stochastic Petri nets. In particular, we compare four cell scheduling policies: a FIFO policy with and without non-preemptive priorities, a threshold priority policy as recently proposed by Lee and Sengupta, and an extension thereof. The aim of this paper is twofold. First, we want to stress ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002